Optimization of Placement for Modern VLSI Design

نویسندگان

  • R. Prabhakar
  • K. Soundara Rajan
چکیده

The VLSI placement problem is to place objects into a fixed die such that there are no overlaps among objects and some cost metrics (wire length, routability) are optimized. The nature of multiple objects and incremental design process for modern VLSI design demands Advanced Incremental Placement Techniques. Incremental placement changes either the wire length or the Placement Density of an existing placement to optimize one or more design objectives.The difficulty of Incremental Placement lies in that it is hard to optimize one design objective while maintaining the existing optimized design objectives. In this dissertation, three main approaches are used to overcome this problem. The first approach is to perform sensitivity analysis and make smaller changes one step at a time on the most sensitive direction. This approach always changes placement in the direction where a change can result in the highest improvement in design objective. The second approach is to maintain the relative order during Incremental Placement. This is called a „Correct-by-construction‟ approach. When we move cells while maintaining their relative order, it is implicitly preserve the existing design characteristics. The third approach is to specify maintain other design constraints while optimizing one design objective. This is more direct approach. It needs to formulate design constraints that can be honored by incremental placer. For the first approach, two techniques are available. First technique is „Sensitivity based Netweighting‟. The objective is to maintain both Worst Negative Stack (WNS) and Figure of Merit (FOM), defined as the Total Stack Difference, compared to a certain Threshold for all timing end points. It performs Incremental global placements with the netweights based on comprehensive analysis of the wirelength, Slack on FOM sensitivities to the netweight. The second technique is noise map driven two step incremental placements. The novel noise map is used to estimate the placement impact on coupling noise, which takes into account of Coupling Capacitance, Driver Resistance and Wire resistance. It performs a two step incremental placement i.e., cell inflation and Local refinement, to expand regions with high noise impact in order to reduce Total Noise. The technique for second approach is Diffusion based Placement Migration, which is the smooth movement of the cells in an existing placement to address a variety of post placement design issues. This method simulates a diffusion process where cells move from high concentration area to low concentration area. The application on Placement Legalization shows significant improvements in wirelength and timing as compared to the other commonly used legalization techniques. For the third approach, a technique called First-do-no-harm detailed placement is used. It uses set of pin-based timing and electrical constraints to prevent detailed placement techniques from degrading timing or violating electrical constraints while reducing wirelength. This technique will provide better result for detailed placement not only reduces Total Wirelength (TWL), but also significantly improves timing. General Terms Your general terms must be any term which can be used for general classification of the submitted material such as Pattern Recognition, Security, Algorithms et. al.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Multi Objective Particle Swarm Optimization Algorithm for FPGA Placement (RESEARCH NOTE)

Placement process is one of the vital stages in physical design. In this stage, modules and elements of circuit are placed in distinct locations according to optimization basis. So that, each placement process tries to influence on one or more optimization factor. In the other hand, it can be told unequivocally that FPGA is one of the most important and applicable devices in our electronic worl...

متن کامل

An Improved Standard Cell Placement Methodology using Hybrid Analytic and Heuristic Techniques

In recent years, size of VLSI circuits is dramatically grown and layout generation of current circuits has become a dominant task in design flow. Standard cell placement is an effective stage of physical design and quality of placement affects directly on the performance, power consumption and signal immunity of design. Placement can be performed analytically or heuristically. Analytical placer...

متن کامل

Modeling and Layout Optimization of VLSI Devices and Interconnects In Deep Submicron Design

This paper presents an overview of recent advances on modeling and layout optimization of devices and interconnects for high-performance VLSI circuit design under the deep submicron technology. First, we review a number of interconnect and driver/gate delay models, which are most useful to guide the layout optimization. Then, we summarize the available performance optimization techniques for VL...

متن کامل

Multi Objective Inclined Planes System Optimization Algorithm for VLSI Circuit Partitioning

In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbal...

متن کامل

VISCOUS DAMPER PLACEMENT OPTIMIZATION IN CONCRETE STRUCTURES USING COLLIDING BODIES ALGORITHM AND STORY DAMAGE INDEX

Dampers can reduce structural response under dynamic loads. Since dampers are costly, the design of structures equipped with dampers should make their application economically justifiable. Among the effective cost reduction factors is optimal damper placement. Hence, this study intended to find the optimal viscous damper placement using efficient optimization methods. Taking into account the no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011